An Analysis of Deductive-Query Processing Approaches for Logic Macroprograms in Wireless Sensor Networks

Logic macroprogramming paradigms for wireless sensor networks (WSNs) are rule-based abstractions for programming a network as a whole. Programmers only focus on the main objective of the network rather than the low-level implementation details on each node. Therefore, the low-level details are automatically handled by underlying middleware of the paradigms. To be viable, the middleware must efficiently handle the underlying issues as well as effectively minimize energy consumption and communication overhead. Not surprisingly, one major underlying issue in logic macroprogramming systems is deductive-query processing. In this paper, we analyze the characteristics of deductive-query processing and identify what have been overlooked in those previous approaches. Furthermore, we overview, analyze, and compare several recent approaches for deductive-query processing of logic macroprograms in WSNs. Our analysis reveals several important aspects that should be considered when designing such systems

Abstract

In-network data aggregation is essential for wireless sensor networks where energy resources are limited. In a previously proposed data dissemination scheme (directed diffusion with opportunistic aggregation), data is opportunistically aggregated at intermediate nodes on a lowlatency tree. In this paper, we explore and evaluate greedy aggregation, a novel approach that adjusts aggregation points to increase the amount of path sharing, reducing energy consumption. Our preliminary results suggest that, under investigated scenarios, greedy aggregation can achieve up to 45 % energy savings over opportunistic aggregation in high-density networks without adversely impacting latency or robustness.

Declarative Resource Naming for Macroprogramming Wireless Networks of Embedded Systems

Programming Wireless Networks of Embedded Systems (WNES) is notoriously difficult and tedious. To simplify WNES programming, we propose Declarative Resource Naming (DRN) to program WNES as a whole (i.e., macroprogramming) instead of several networked entities. DRN allows programmers to declaratively describe a set of desired resources by their run-time properties and to map this set to a variable. Using DRN, resource accesses are simplified to completely network-transparent accesses of variables. DRN provides both individual and group accesses to the desired set. Group accesses (i.e., parallel accesses) reduce total access time and energy consumption because of possible in-network processing. Additionally, we can associate each set with tuning parameters (e.g., timeout, energy budget) to bound access time or to tune resource consumption.Pre-2018 CSE ID: CS2004-080

The Sink-based Anycast Routing Protocol for Ad Hoc Wireless Sensor Networks

The first anycast routing protocol for ad hoc wireless sensor networks is presented and referred to here as the Sink-based Anycast Routing Protocol(SARP). Instead of sending a packet to a specific destination, the packet is delivered to the nearest sink. In some domains of applications, which sink obtains data is not crucial. Nearest-sink delivery consumes minimal bandwidth and power, causes smallest delay, and is best suited for resource location applications. The proposed SARP is highly adaptive, efficient, and suitable for dynamic networks, as shown here by a detailed packet level simulation on the NS-2 network simulator